Integration on a convex polytope

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Farthest Neighbors on a Convex Polytope

Let be a set of points in convex position in . The farthest-point Voronoi diagram of partitions into convex cells. We consider the intersection of the diagram with the boundary of the convex hull of . We give an algorithm that computes an implicit representation of in expected time. More precisely, we compute the combinatorial structure of , the coordinates of its vertices, and the equation of ...

متن کامل

Gibbs/Metropolis algorithms on a convex polytope

This paper gives sharp rates of convergence for natural versions of the Metropolis algorithm for sampling from the uniform distribution on a convex polytope. The singular proposal distribution, based on a walk moving locally in one of a fixed, finite set of directions, needs some new tools. We get useful bounds on the spectrum and eigenfunctions using Nash and Weyltype inequalities. The top eig...

متن کامل

The Intersection of Convex Transversals is a Convex Polytope

It is proven that the intersection of convex transversals of finitely many sets in R is a convex polytope, possibly empty. Related results on support hyperplanes and complements of finite unions of convex sets are given. MSC 2000: 52A20

متن کامل

Large-Margin Convex Polytope Machine

We present the Convex Polytope Machine (CPM), a novel non-linear learning algorithm for large-scale binary classification tasks. The CPM finds a large margin convex polytope separator which encloses one class. We develop a stochastic gradient descent based algorithm that is amenable to massive data sets, and augment it with a heuristic procedure to avoid sub-optimal local minima. Our experiment...

متن کامل

The Mean Width of a Convex Polytope

In the case n=d = 2, because of Cauchy's surface-area formula [2; p. 208], relation (3) reduces to the trivial statement that the perimeter of a convex polygon is equal to the sum of the lengths of its edges. If K is any closed bounded convex set of dimension at most d, we may write KaEczE and use md(K) and mn(K) to denote the mean widths of K relative to the spaces E and E respectively. A simp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1998

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-98-04454-2